Cryptographic Aspects of Real Hyperelliptic Curves

نویسندگان

  • Michael J. Jacobson
  • Renate Scheidler
  • Andreas Stein
چکیده

In this paper, we give an overview of cryptographic applications using real hyperelliptic curves. We review previously proposed cryptographic protocols and discuss the infrastructure of a real hyperelliptic curve, the mathematical structure underlying all these protocols. We then describe recent improvements to infrastructure arithmetic, including explicit formulas for divisor arithmetic in genus 2, and advances in solving the infrastructure discrete logarithm problem, whose presumed intractability is the basis of security for the related cryptographic protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation

In this paper, we present for the first time efficient explicit formulas for arithmetic in the degree 0 divisor class group of a real hyperelliptic curve. Hereby, we consider real hyperelliptic curves of genus 2 given in affine coordinates for which the underlying finite field has characteristic > 3. These formulas are much faster than the optimized generic algorithms for real hyperelliptic cur...

متن کامل

Cryptographic protocols on real hyperelliptic curves

We present public-key cryptographic protocols for key exchange, digital signatures, and encryption whose security is based on the presumed intractability of solving the principal ideal problem, or equivalently, the distance problem, in the real model of a hyperelliptic curve. Our protocols represent a significant improvement over existing protocols using real hyperelliptic curves. Theoretical a...

متن کامل

Faster Cryptographic Key Exchange on Hyperelliptic Curves

We present a new approach to key exchange based on divisor arithmetic for the real model of a hyperelliptic curve over a finite field, as opposed to the imaginary representation that is normally used for cryptographic applications. Using generic divisor arithmetic, our protocol is almost fifteen percent faster than conventional key exchange using hyperelliptic curves, with the most significant ...

متن کامل

Explicit Infrastructure for Real Quadratic Function Fields and Real Hyperelliptic Curves

In 1989, Koblitz first proposed the Jacobian of a an imaginary hyperelliptic curve for use in public-key cryptographic protocols. This concept is a generalization of elliptic curve cryptography. It can be used with the same assumed key-per-bit strength for small genus. More recently, real hyperelliptic curves of small genus have been introduced as another source for cryptographic protocols. The...

متن کامل

Comparison of scalar multiplication on real hyperelliptic curves

Real hyperelliptic curves admit two structures suitable for cryptography — the Jacobian (a finite abelian group) and the infrastructure. Mireles Morales described precisely the relationship between these two structures, and made the assertion that when implemented with balanced divisor arithmetic, the Jacobian generically yields more efficient arithmetic than the infrastructure for cryptographi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010